a memetic algorithm for designing a capacitated hub network under demand uncertainty and disruption

hub location problems are among the extensions ofclassical location problems that have numerous applications in designingtransportation, postal, and telecommunication networks. despite the evidentattention of researchers to these problems, there are few studies on designinghub networks under uncertainty and disruption. in this study, the capacitatedsingle allocation hub location problem under demand uncertainty and disruptionis investigated. first, a mathematical model based on budget of uncertaintyconcept is proposed, then a hybrid solution method based on genetic algorithmand variable neighborhood search is proposed. computational experimentsdemonstrate the accuracy of the proposed solution method in solving the testinstances. in addition, the results obtained from conducting monte-carlosimulation experiments to analyze the effects of uncertainty on the performanceof different hub network configurations show the necessity of consideringdemand uncertainty and disruption while designing hub networks.